On diakoptics in a Cauer-Routh setting

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Comments on "Routh Stability Criterion"

— In this note, we have shown special case on Routh stability criterion, which is not discussed, in previous literature. This idea can be useful in computer science applications.

متن کامل

On Diakoptics: Tearing an Arbitrary System*

Kron's techniques of tearing and if-partitioning are discussed as they apply to large linear systems of an arbitrary nature and tearing is discarded as inefficient. It is shown that decreasing the size of the sub-units in if-partitioning increases its efficiency; carried to the limit, this reduction results in a Gaussian elimination scheme. Finally, the optimum application of if-partitioning is...

متن کامل

a study on rate making and required reserves determination in reinsurance market: a simulation

reinsurance is widely recognized as an important instrument in the capital management of an insurance company as well as its risk management tool. this thesis is intended to determine premium rates for different types of reinsurance policies. also, given the fact that the reinsurance coverage of every company depends upon its reserves, so different types of reserves and the method of their calc...

Routh Reduction by Stages

This paper deals with the Lagrangian analogue of symplectic or point reduction by stages. We develop Routh reduction as a reduction technique that preserves the Lagrangian nature of the dynamics. To do so we heavily rely on the relation between Routh reduction and cotangent symplectic reduction. The main results in this paper are: (i) we develop a class of so called magnetic Lagrangian systems ...

متن کامل

Parallel Simulation of Nonlinear Networks Using Diakoptics

This paper is concerned with the evaluation of a new algorithm for simulation of large scale nonlinear network systems as typified by water distribution networks. The algorithm, described in detail in [2], is a development and generalisation of Kron’s ideas on tearing linear systems [1] and it combines Newton-Raphson iterative process with diakoptical calculation of state increments at each ite...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Quarterly of Applied Mathematics

سال: 1981

ISSN: 0033-569X,1552-4485

DOI: 10.1090/qam/99628